Percolation thresholds on elongated lattices

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Percolation thresholds on elongated lattices

We investigate the percolation thresholds of both random and invasion percolation in two and three dimensions on elongated lattices; lattices with a geometry of Ld−1 × nL in d dimensions, where n denotes the aspect ratio of the lattice. Scaling laws for the threshold and spanning cluster density for random percolation are derived and simulation confirms the behaviour. A direct relationship betw...

متن کامل

Estimation of Bond Percolation Thresholds on the Archimedean Lattices

We give accurate estimates for the bond percolation critical probabilities on seven Archimedean lattices, for which the critical probabilities are unknown, using an algorithm of Newman and Ziff.

متن کامل

Similarity of Percolation Thresholds on the HCP and FCC Lattices

Extensive Monte-Carlo simulations were performed in order to determine the precise values of the critical thresholds for site (p c,S = 0.199 255 5 ± 0.000 001 0) and bond (p hcp c,B = 0.120 164 0 ± 0.000 001 0) percolation on the hcp lattice to compare with previous precise measuremens on the fcc lattice. Also, exact enumeration of the hcp and fcc lattices was performed and yielded generating f...

متن کامل

Site percolation thresholds and universal formulas for the Archimedean lattices

The site percolation thresholds pc are determined to high precision for eight Archimedean lattices, by the hull-walk gradient-percolation simulation technique, with the results pc = 0.697 043, honeycomb or (6 ), 0.807 904 (3, 12), 0.747 806 (4, 6, 12), 0.729 724 (4, 8), 0.579 498 (3, 6), 0.621 819 (3, 4, 6, 4), 0.550 213 (3, 4), and 0.550 806 (3, 4, 3, 4), and errors of about ±2 × 10. (The rema...

متن کامل

Universal condition for critical percolation thresholds of kagomé-like lattices.

Lattices that can be represented in a kagomé-like form are shown to satisfy a universal percolation criticality condition, expressed as a relation between P3 , the probability that all three vertices in the triangle connect, and P0 , the probability that none connect. A linear approximation for P3(P0) is derived and appears to provide a rigorous upper bound for critical thresholds. A numericall...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Physics A: Mathematical and General

سال: 1999

ISSN: 0305-4470,1361-6447

DOI: 10.1088/0305-4470/32/44/101